Asymmetric binary tree coding for contour images

نویسندگان

  • Ahsan Shamim
  • John A. Robinson
چکیده

We consider the coding of featured contours, i.e. texture, object or motion boundaries in images. The MPEG-4 and MPEG-7 video coding standards provide for a content-based representation of video information, so efficient coding of boundaries can play an important role. We propose a new coding scheme that uses an asymmetric binary tree. We show that the new scheme outperforms conventional quadtree, binary tree, contour and READ coding algorithms applied to typical boundary images and also offers competitive performance for general-purpose two-level image coding.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lossless Contour Compression Using Chain-code Representations and Context Tree Coding

In this paper we experimentally study the context tree coding of contours in two alternative chain-code representations. The contours of the image regions are intersecting, resulting in many contour segments, each contour segment being represented by its starting position and a subsequence of chain-code symbols. A single stream of symbols is obtained, under a given ordering of the segments, by ...

متن کامل

ناحیه‌بندی مرز اندوکارد بطن چپ در تصاویر تشدید مغناطیسی قلبی با شدت روشنایی غیریکنواخت

The stochastic active contour scheme (STACS) is a well-known and frequently-used approach for segmentation of the endocardium boundary in cardiac magnetic resonance (CMR) images. However, it suffers significant difficulties with image inhomogeneity due to using a region-based term based on the global Gaussian probability density functions of the innerouter regions of the active ...

متن کامل

Binary contour coding using Bézier approximation

Ahs/raCl: A method for coding of binary image contour using B6zier approximalion is proposed. A set of key pixel (guiding pixels) on the contour is defined which enables the contour to be decomposed into arcs and straight line segments. A set of cleaning operations has been considered as an intermedIate step before producing the final output. The quality of faithful reproduetion of the decoded ...

متن کامل

Probabilistic analysis of the asymmetric digital search trees

In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...

متن کامل

Segmentation of MR Data-Images Using a First-Order Deformable Spline Curve

This article describes an image segmentation procedure applied over magnetic resonance (MR) data-images. The applied technique is based on a contour propagation process deened by an energy minimization analysis. The nal contour of each volume of the heart is deened by a propagation process (spline deformable curve) added to a re-sampling procedure which increases the number of control points. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Image Vision Comput.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2003